Nilpotence relations in products of groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Testing Nilpotence of Galois Groups in Polynomial Time

We give the first polynomial-time algorithm for checking whether the Galois group Gal (f) of an input polynomial f(X) ∈ Q[X] is nilpotent: the running time of our algorithm is bounded by a polynomial in the size of the coefficients of f and the degree of f . Additionally, we give a deterministic polynomial-time algorithm that, when given as input a polynomial f(X) ∈ Q[X] with nilpotent Galois g...

متن کامل

Brauer pairs of Camina p - groups of nilpotence class 2

In this paper, we find a condition that characterizes when two Camina p-groups of nilpotence class 2 form a Brauer pair. MSC primary: 20C15

متن کامل

Residual Nilpotence for Generalizations of Pure Braid Groups

It is known that the pure braid groups are residually torsion-free nilpotent. This property is however widely open for the most obvious generalizations of these groups, like pure Artin groups and like fundamental groups of hyperplane complements (even reflection ones). In this paper we relate this problem to the faithfulness of linear representations, and prove the residual torsion-free nilpote...

متن کامل

A Note on The Local Nilpotence of 4-Engel Groups

Recently Havas and Vaughan-Lee proved that 4-Engel groups are locally nilpotent. Their proof relies on the fact that a certain 4-Engel group T is nilpotent and this they prove using a computer and the Knuth-Bendix algorithm. In this paper we give a short hand-proof of the nilpotency of T .

متن کامل

CHARACTER DEGREES AND NILPOTENCE CLASS OF FINITE p-GROUPS: AN APPROACH VIA PRO-p GROUPS

Let S be a finite set of powers of p containing 1. It is known that for some choices of S, if P is a finite p-group whose set of character degrees is S, then the nilpotence class of P is bounded by some integer that depends on S, while for some other choices of S such an integer does not exist. The sets of the first type are called class bounding sets. The problem of determining the class bound...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Group Theory

سال: 2020

ISSN: 1435-4446,1433-5883

DOI: 10.1515/jgth-2020-0135